SAT-based Combinational Equivalence Checking
نویسندگان
چکیده
Combinational equivalence checking is one of the key components in today’s hardware verification methodology. Structural similarity of the two designs are exploited by existing BDD, SAT, or ATPG based methods. This report presents a technique for improving the performance of the existing SAT-based combinational equivalence checkers by adding new constraints based on the structural similarity. Our experimental results using ISCAS benchmarks demonstrate the usefulness of this approach.
منابع مشابه
SAT-Based Combinational and Sequential Dependency Computation
We present an algorithm for computing both functional dependency and unateness of combinational and sequential Boolean functions represented as logic networks. The algorithm uses SAT-based techniques from Combinational Equivalence Checking (CEC) and Automatic Test Pattern Generation (ATPG) to compute the dependency matrix of multi-output Boolean functions. Additionally, the classical dependency...
متن کاملCollection of Combinational Arithmetic Miters
In this short note we present a collection of benchmarks submitted to the SAT Competition 2016. Most of them stem from other sources, some crafted ones are new, but all present equivalence checking problems (miters) for arithmetic circuits, such as multipliers.
متن کاملUsing Global Structural Relationships of Signals to Accelerate SAT-based Combinational Equivalence Checking
We propose a novel technique to improve SAT-based Combinational Equivalence Checking (CEC). The idea is to perform a low-cost preprocessing that will statically induce global signal relationships into the original CNF formula of the miter circuit under verification, and hence reduce the complexity of the SAT instance. This efficient and effective preprocessing quickly builds up the implication ...
متن کاملEquivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight integration of a structural satisfiability (SAT) solver, BDD sweeping, and random simulation; all three working on a shared graph representation of the circuit. The BDD sweeping and SAT solver are applied in an intertw...
متن کاملAlgorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation (EDA). It finds application in test pattern generation, delay-fault testing, combinational equivalence checking and circuit delay computation, among many other problems. Moreover, Boolean Satisfiability is also in the core of algorithms for solving Binate Covering Problems. This paper starts by describing how B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005